A `3+1' method for finding principal null directions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

Principal Directions-Based Pivot Placement

Determining a good sets of pivots is a challenging task for metric space indexing. Several techniques to select pivots from the data to be indexed have been introduced in the literature. In this paper, we propose a pivot placement strategy which exploits the natural data orientation in order to select space points which achieve a good alignment with the whole data to be indexed. Comparison with...

متن کامل

Finding Referents While Following Directions

If a robot accepts directions in natural language, it must find the referents of NP’s in the directions. A robot cannot always find the referents before it starts to execute the directions. It is often necessary to execute part of a command, find a referent, and continue execution. Here is an example, drawn from an experiment in which subjects give directions to a simulated robot. The robot is ...

متن کامل

A k-segments algorithm for finding principal curves

We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines. New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical and Quantum Gravity

سال: 1995

ISSN: 0264-9381,1361-6382

DOI: 10.1088/0264-9381/12/1/011